Spectral Properties of Adjacency and Distance Matrices for Various Networks
نویسنده
چکیده
The spectral properties of the adjacency (connectivity) and distance matrix for various types of networks: exponential, scale-free (Albert–Barabási) and classical random ones (Erdős–Rényi) are evaluated. The graph spectra for dense graph in the Erdős–Rényi model are derived analytically.
منابع مشابه
Effect of Unfolding on the Spectral Statistics of Adjacency Matrices of Complex Networks
Random matrix theory is finding an increasing number of applications in the context of information theory and communication systems, especially in studying the properties of complex networks. Such properties include short-term and long-term correlation. We study the spectral fluctuations of the adjacency of networks using random-matrix theory. We consider the influence of the spectral unfolding...
متن کاملAlgebraic properties of a digraph and its line digraph
Let G be a digraph, LG its line digraph and A(G) and A(LG) their adjacency matrices. We present relations between the Jordan Normal Form of these two matrices. Besides, we study the spectra of those matrices and obtain a relationship between their characteristic polynomials that allows to relate properties of G and LG regarding the number of cycles of a given length.
متن کاملJoint and Generalized Spectral Radius of Upper Triangular Matrices with Entries in a Unital Banach Algebra
In this paper, we discuss some properties of joint spectral {radius(jsr)} and generalized spectral radius(gsr) for a finite set of upper triangular matrices with entries in a Banach algebra and represent relation between geometric and joint/generalized spectral radius. Some of these are in scalar matrices, but some are different. For example for a bounded set of scalar matrices,$Sigma$, $r_*...
متن کاملAssessing Percolation Threshold Based on High-Order Non-Backtracking Matrices
Percolation threshold of a network is the critical value such that when nodes or edges are randomly selected with probability below the value, the network is fragmented but when the probability is above the value, a giant component connecting a large portion of the network would emerge. Assessing the percolation threshold of networks has wide applications in network reliability, information spr...
متن کاملStructural Relationship Between Randić Indices, Adjacency, Distance Matrixes and Molar Absorption Coefficient of Linear Conjugated Polyene Compounds
One of the useful indices in molecular topology is Randić index. The alternative double bonds andconjugation in the polyene compounds are one of the main properties in these compounds. Someof the molecular orbital and structural properties refer to this specialty, such as: molar absorptioncoefficient (εmax) , electrical conductivity and difference energy level of the HOMO and LUMOorbitals, etc....
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2008